package 力扣._00周赛._367周赛.问题1;

public class Solution {
    public int[] findIndices(int[] nums, int indexDifference, int valueDifference) {
        //
        int[] r = new int[]{-1, -1};
        for (int i = 0; i < nums.length; i++) {
            for (int j = 0; j < nums.length; j++) {
                if (Math.abs(i - j) >= indexDifference && Math.abs(nums[i] - nums[j]) >= valueDifference){
                    r[0] = i;
                    r[1] = j;
                    return r;
                }
            }
        }
        return r;
    }
}
